Convexity in Hamilton-Jacobi Theory I: Dynamics and Duality

نویسندگان

  • R. Tyrrell Rockafellar
  • Peter R. Wolenski
چکیده

Value functions propagated from initial or terminal costs and constraints by way of a differential inclusion, or more broadly through a Lagrangian that may take on∞, are studied in the case where convexity persists in the state argument. Such value functions, themselves taking on ∞, are shown to satisfy a subgradient form of the Hamilton-Jacobi equation which strongly supports properties of local Lipschitz continuity, semidifferentiability and Clarke regularity. An extended ‘method of characteristics’ is developed which determines them from the Hamiltonian dynamics underlying the given Lagrangian. Close relations with a dual value function are revealed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Duality and dynamics in Hamilton-Jacobi theory for fully convex problems of control

This paper describes some recent results in HamiltonJacobi theory that hold under strong convexity assumptions on the data. Generalizations of linearquadratic control models satisfy such assumptions, for example. The results include a global method of characteristics and a strong duality theory.

متن کامل

Convexity and Duality in Hamilton-Jacobi Theory

Value functions propagated from initial or terminal costs and constraints by way of a differential inclusion, or more broadly through a Lagrangian that may take on∞, are studied in the case where convexity persists in the state argument. Such value functions, themselves taking on ∞, are shown to satisfy a subgradient form of the Hamilton-Jacobi equation which strongly supports properties of loc...

متن کامل

SOME PROPERTIES FOR FUZZY CHANCE CONSTRAINED PROGRAMMING

Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...

متن کامل

Convexity in Hamilton-Jacobi Theory II: Envelope Representations

Upper and lower envelope representations are developed for value functions associated with problems of optimal control and the calculus of variations that are fully convex, in the sense of exhibiting convexity in both the state and the velocity. Such convexity is used in dualizing the upper envelope representations to get the lower ones, which have advantages not previously perceived in such ge...

متن کامل

Envelope representations in Hamilton-Jacobi theory for fully convex problems of control

This paper is a sequel to the one in this same session which surveys recent results on the role of convexity in Hamilton-Jacobi theory. We describe here how value functions in optimal control can be represented as upper and lower envelopes involving so-called kernel functions. Particularly noteworthy is a lower envelope formula given in terms of the dualizing kernel, which is a value function i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Control and Optimization

دوره 39  شماره 

صفحات  -

تاریخ انتشار 2000